unsaturated vertex

Игры ⚽ Нужно решить контрольную?

Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Baldness treatments — More than half of men are affected by male pattern baldness by age 50, and baldness treatments are estimated to be a US $1 billion per year industry.cite web|url=http://www.intelihealth.com/IH/ihtIH/WSIHW000/9023/24253/352721.html?d=dmtContent|aut… … Wikipedia
coordination compound — Chem. complex (def. 10). Also called coordination complex. * * * ▪ chemistry Introduction any of a class of substances with chemical structures in which a central metal atom is surrounded by nonmetal atoms or groups of atoms, called ligands… … Universalium
Saturation (graph theory) — Let G(V,E) be a graph and M a matching in G. A vertex vin V(G) is said to be saturated by M if there is an edge in M incident to v. A vertex vin V(G) with no such edge is said to be unsaturated by M. We also say that M saturates v.ee also* Hall s … Wikipedia
borane — /bawr ayn, bohr /, n. Chem. any of the compounds, both neutral and anionic, of boron and hydrogen with formulas ranging from B2H6 to B20H16. Also called boron hydride. [ < G Boran (1916); see BORON, ANE] * * * ▪ chemical compound Introduction… … Universalium

Словари и энциклопедии на Академике